Analog Matching of Colored Sources to Colored Channels
نویسندگان
چکیده
منابع مشابه
Analog Matching of Colored Sources to Colored Channels † Yuval Kochman and Ram Zamir
Analog (uncoded) transmission provides a simple and robust scheme for communicating a Gaussian source over a Gaussian channel under the mean squared error (MSE) distortion measure. Unfortunately, its performance is usually inferior to the all-digital, separation-based source-channel coding solution, which requires exact knowledge of the channel at the encoder. The loss comes from the fact that ...
متن کاملMatching colored points with rectangles
Let S be a point set in the plane such that each of its ele1 ments is colored either red or blue. A matching of S with rectangles is 2 any set of pairwise-disjoint axis-aligned rectangles such that each rectan3 gle contains exactly two points of S. Such a matching is monochromatic 4 if every rectangle contains points of the same color, and is bichromatic if 5 every rectangle contains points of ...
متن کاملEfficient Colored Point Set Matching Under Noise
Let A and B be two colored point sets in R2, with |A| ≤ |B|. We propose a process for determining matches, in terms of the bottleneck distance, betweenA and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. The process consists of two main stages: a lossless filtering algorithm and a matching alg...
متن کاملRainbow Matching in Edge-Colored Graphs
A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li conjectured that for k > 4, every edge-colored graph with minimum color degree at least k contains a rainbow matching of size at least ⌈k/2⌉. We prove the slightly weaker statement that a rainbow matching...
متن کاملColored Homomorphisms of Colored Mixed Graphs
The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic coloring number and oriented chromatic number, have been recently studied. Improving and combining earlier techniques of N. Alon and T. H. Marshall (1998, J. Algebraic Combin. 8, 5 13) and A. Raspaud and E. Sopena (1994, Inform. Process. Lett. 51, 171 174) we prove here a general ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2132950